Periodic groups in which the centralizer of an involution has bounded order

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On solubility of groups with bounded centralizer chains

The c-dimension of a group is the maximum length of a chain of nested centralizers. It is proved that a periodic locally soluble group of finite cdimension k is soluble of derived length bounded in terms of k, and the rank of its quotient by the Hirsch–Plotkin radical is bounded in terms of k. Corollary: a pseudo-(finite soluble) group of finite c-dimension k is soluble of derived length bounde...

متن کامل

Groups in which every subgroup has finite index in its Frattini closure

‎In 1970‎, ‎Menegazzo [Gruppi nei quali ogni sottogruppo e intersezione di sottogruppi massimali‎, ‎ Atti Accad‎. ‎Naz‎. ‎Lincei Rend‎. ‎Cl‎. ‎Sci‎. ‎Fis‎. ‎Mat‎. ‎Natur. 48 (1970)‎, ‎559--562.] gave a complete description of the structure of soluble $IM$-groups‎, ‎i.e.‎, ‎groups in which every subgroup can be obtained as intersection of maximal subgroups‎. ‎A group $G$ is said to have the $FM$...

متن کامل

THE ORDER GRAPHS OF GROUPS

Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...

متن کامل

Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree

A k-digraph is a digraph in which every vertex has outdegree at most k. A (k ∨ l)digraph is a digraph in which a vertex has either outdegree at most k or indegree at most l. Motivated by function theory, we study the maximum value Φ(k) (resp. Φ(k, l)) of the arc-chromatic number over the k-digraphs (resp. (k ∨ l)-digraphs). El-Sahili [3] showed that Φ(k, k) ≤ 2k+1. After giving a simple proof o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1980

ISSN: 0021-8693

DOI: 10.1016/0021-8693(80)90147-7